WPS No . 621 / February 2008 Workflow Graph Verification Using Graph Search Techniques

نویسنده

  • Sinnakkrishnan Perumal
چکیده

Workflow management systems provide a flexible way of implementing business processes. Structural conflicts such as deadlock and lack of synchronization are commonly occurring errors in workflow processes. Workflows with structural conflicts may lead to error-prone and undesirable results in business processes, which may in turn affect customer satisfaction, employee productivity, and integrity of data, and may also cause legal issues. Workflow verification is meant for detecting structural conflicts in workflow processes. Workflow management systems do not have the functionality for workflow verification except through simulation which does not detect the error completely. In this paper, we present a simple workflow verification method based on the principle of depth-first search. This method is meant for verifying acyclic workflow graphs. We illustrate our method with detailed workouts using business examples. We also present a detailed theoretical analysis and empirical evaluation of the proposed method. We compare our method with the well-known graph reduction based method. We observe that our method provides significantly better results. Workflow verification is crucial as workflows with structural conflicts when deployed will cause malfunctioning of workflow management systems. Moreover, our method has worst-case time complexity of O(E) as against O((E+N).N) for the graph reduction method. We believe that our method will make the workflow verification task simpler and efficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation and Formal Analysis of Workflow Models

We present a framework for the simulation and formal analysis of workflow models. We discuss (i) how a workflow model, implemented in the BPEL language, can be transformed into a dataflow network model, (ii) how potentially incorrect execution paths can be incorporated, and (iii) how the properties of a workflow can be formally verified using the SPIN model checker. For the several model transf...

متن کامل

Automatic Workflow Graph Refactoring and Completion

Workflow graphs are used to model the control flow of business processes in various languages, e.g., BPMN, EPCs and UML activity diagrams. We present techniques for automatic workflow graph refactoring and completion. These techniques enable various use cases in modeling and runtime optimization. For example they allow us to complete a partial workflow graph, they provide local termination dete...

متن کامل

Partial Recognizing Algorithm for Verification Of

The paper presents the formal definition of workflow process, its semantics and correctness assertion. A partial recognizing algorithm for formal verification of acyclic workflow processes is suggested. The algorithm uses molds that represent upper and lower approximations of environment state sets. The consideration of mold transformations on all branching paths allows to avoid the process exe...

متن کامل

Timing constraint workflow nets for workflow analysis

The analysis of the correctness and rationality of a workflow model plays an important role in the research of workflow techniques and successful implementation of workflow management. This paper points out the relevant problems in the verification and analysis of a workflow model. It discusses two important properties: schedulability and boundedness of a workflow model considering timing const...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008